By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 34, Issue 3, pp. 515-773

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Top-Down Analysis of Path Compression

Raimund Seidel and Micha Sharir

pp. 515-525

BibTeX  Abstract Full Text:  PDF

Pseudo-Line Arrangements: Duality, Algorithms, and Applications

Pankaj K. Agarwal and Micha Sharir

pp. 526-552

BibTeX  Abstract Full Text:  PDF

Layout of Graphs with Bounded Tree-Width

Vida Dujmovic, Pat Morin, and David R. Wood

pp. 553-579

BibTeX  Abstract Full Text:  PDF

Abstract Combinatorial Programs and Efficient Property Testers

Artur Czumaj and Christian Sohler

pp. 580-615

BibTeX  Abstract Full Text:  PDF

Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input

Aris Anagnostopoulos, Adam Kirsch, and Eli Upfal

pp. 616-639

BibTeX  Abstract Full Text:  PDF

A Second-Order Perceptron Algorithm

Nicolò Cesa-Bianchi, Alex Conconi, and Claudio Gentile

pp. 640-668

BibTeX  Abstract Full Text:  PDF

Nonmigratory Online Deadline Scheduling on Multiprocessors

Ho-Leung Chan, Tak-Wah Lam, and Kar-Keung To

pp. 669-682

BibTeX  Abstract Full Text:  PDF

On Even Triangulations of 2-Connected Embedded Graphs

Huaming Zhang and Xin He

pp. 683-696

BibTeX  Abstract Full Text:  PDF

Fault-Tolerant Scheduling

Bala Kalyanasundaram and Kirk R. Pruhs

pp. 697-719

BibTeX  Abstract Full Text:  PDF

Classifying the Complexity of Constraints Using Finite Algebras

Andrei Bulatov, Peter Jeavons, and Andrei Krokhin

pp. 720-742

BibTeX  Abstract Full Text:  PDF

Online Scheduling of Precedence Constrained Tasks

Yumei Huo and Joseph Y. T. Leung

pp. 743-762

BibTeX  Abstract Full Text:  PDF

Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds

J. Könemann and R. Ravi

pp. 763-773

BibTeX  Abstract Full Text:  PDF